Fast algorithms for determining the linear complexities of sequences over GF (p) with the period 3n
نویسنده
چکیده
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF (p)(any positive integer m) with the period 3n (n and p−1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF (p) with the period 3n (n and p − 1 are coprime) more efficiently.
منابع مشابه
Ju l 2 00 6 Reducing the Computation of Linear Complexities of Periodic Sequences
The linear complexity of a periodic sequence over GF (p) play an important role in cryptography and communication([1]). In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of an arbitrary period un (where u|p−1, gcd(n, p −1) = 1) sequence over GF (p) to the computation of the linear complexities and minimal connectio...
متن کاملReducing the Computation of Linear Complexities of Periodic Sequences over GF(pm)
The linear complexity of a periodic sequence over GF (pm) plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of a period un sequence over GF (pm) to the computation of the linear complexities and minimal connection polynomials of u period n sequences. T...
متن کاملFast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
متن کاملFast Algorithms for Determining the Minimal Polynomials of Sequences with Period kn Over GF(Pm)
A fast algorithm is derived for determining the linear complexity and the minimal polynomials of sequences over GF (p) with period kn, where p is a prime number, gcd(n, p − 1) = 1 and p − 1 = ku, n, k and u are integers. The algorithm presented here covers the algorithm proposed by Chen for determining the minimal polynomials of sequences over GF (p) with period 2n, where p is a prime, gcd(n, p...
متن کاملOn the binary sequences with high GF(2) linear complexities and low GF(p) linear complexities
Klapper [1] showed that there are binary sequences of period q − 1(q is a prime power p, p is an odd prime) with the maximal possible linear complexity q−1 when considered as sequences over GF (2), while the sequences have very low linear complexities when considered as sequences over GF (p). This suggests that the binary sequences with high GF (2) linear complexities and low GF (p) linear comp...
متن کامل